Effective Transductive Learning via PAC-Bayesian Model Selection
نویسندگان
چکیده
We study a transductive learning approach based on clustering. In this approach one constructs a diversity of unsupervised models of the unlabeled data using clustering algorithms. These models are then exploited to construct a number of hypotheses using the labeled data and the learner selects an hypothesis that minimizes a transductive PACBayesian error bound, which holds with high probability. Empirical examination of this approach, implemented with spectral clustering, on a suite of benchmark datasets, indicates that the new approach is effective and that on some datasets it significantly outperforms one of the best transductive learning algorithms known today.
منابع مشابه
Pac-bayesian Inductive and Transductive Learning
We present here a PAC-Bayesian point of view on adaptive supervised classification. Using convex analysis on the set of posterior probability measures on the parameter space, we show how to get local measures of the complexity of the classification model involving the relative entropy of posterior distributions with respect to Gibbs posterior measures. We then discuss relative bounds, comparing...
متن کاملEffective transductive learning via objective model selection
This paper is concerned with transductive learning. We study a recent transductive learning approach based on clustering. In this approach one constructs a diversity of unsupervised models of the unlabeled data using clustering algorithms. These models are then exploited to construct a number of hypotheses using the labeled data and the learner selects an hypothesis that minimizes a transductiv...
متن کاملPAC-Bayesian Theory for Transductive Learning
We propose a PAC-Bayesian analysis of the transductive learning setting by proposing a family of new bounds on the generalization error. Inductive Learning Training set We draw m examples i.i.d. from a distribution D on X×{−1,+1}: S = {(x1, y1), (x2, y2), . . . , (xm, ym)} ∼ D . Task of an inductive learner Using S, learn a classifier h : X 7→ {−1,+1} that has a low generalization risk on new e...
متن کاملTransductive Rademacher Complexity and Its Applications
We develop a technique for deriving data-dependent error bounds for transductive learning algorithms based on transductive Rademacher complexity. Our technique is based on a novel general error bound for transduction in terms of transductive Rademacher complexity, together with a novel bounding technique for Rademacher averages for particular algorithms, in terms of their “unlabeled-labeled” re...
متن کاملPAC-Bayesian Policy Evaluation for Reinforcement Learning
Bayesian priors offer a compact yet general means of incorporating domain knowledge into many learning tasks. The correctness of the Bayesian analysis and inference, however, largely depends on accuracy and correctness of these priors. PAC-Bayesian methods overcome this problem by providing bounds that hold regardless of the correctness of the prior distribution. This paper introduces the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004